finite sampling correction - перевод на русский
Diclib.com
Словарь ChatGPT
Поиск в словаре Индивидуальные решения
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология
  1. Словари
  2. Англо-русский словарь
  3. finite sampling correction

finite sampling correction - перевод на русский

COVER OF A SET
Point finite; Point-finite; Point finite collection
Найдено результатов: 816
finite sampling correction      
стат.
поправка на конечность выборки
color correction         
  • Chromaticity diagram, Planckian locus, and lines of constant CCT
PROCESS USED IN STAGE LIGHTING, PHOTOGRAPHY, TELEVISION, CINEMATOGRAPHY, AND OTHER DISCIPLINES, WHICH USES COLOR GELS, OR FILTERS, TO ALTER THE OVERALL COLOR OF THE LIGHT
Colour correction; Color correction filter; Color Temperature Orange; Correct To Orange; Color-correction filter; Color correction gel; Color-correction gel

общая лексика

цветокоррекция, корректура цвета

изменение цветов исходного изображения, чтобы напечатать его наилучшим образом, либо со специальными эффектами

цветоделительная корректура

snowball sampling         
NONPROBABILITY SAMPLING TECHNIQUE
Snowball sample; Respondent-driven sampling; Snowball method; Snowballed sample
выборка типа "снежный ком"; эмпирическая выборка, не имеющая вероятностного обоснования, формируется, когда трудно очертить границы генеральной совокупности путем целенаправленного отбора экспертов и так называемых "редких элементов", которые после интервью могут указать следующий элемент и так далее (используется при изучении закрытых социальных групп - религиозных сект, банд и т.п.).
sampling theorem         
  • the sampled sequences are identical}}, even though the original continuous pre-sampled functions are not. If these were audio signals, <math>x(t)</math> and <math>x_A(t)</math> might not sound the same. But their samples (taken at rate ''f''<sub>s</sub>) are identical and would lead to identical reproduced sounds; thus ''x''<sub>A</sub>(''t'') is an alias of ''x''(''t'') at this sample rate.
  • The samples of two sine waves can be identical when at least one of them is at a frequency above half the sample rate.
  • A family of sinusoids at the critical frequency, all having the same sample sequences of alternating +1 and –1. That is, they all are aliases of each other, even though their frequency is not above half the sample rate.
  • Properly sampled image
  • Subsampled image showing a [[Moiré pattern]]
  • The figure on the left shows a function (in gray/black) being sampled and reconstructed (in gold) at steadily increasing sample-densities, while the figure on the right shows the frequency spectrum of the gray/black function, which does not change. The highest frequency in the spectrum is ½ the width of the entire spectrum. The width of the steadily-increasing pink shading is equal to the sample-rate. When it encompasses the entire frequency spectrum it is twice as large as the highest frequency, and that is when the reconstructed waveform matches the sampled one.
  • Spectrum, ''X<sub>s</sub>''(''f''), of a properly sampled bandlimited signal (blue) and the adjacent DTFT images (green) that do not overlap. A ''brick-wall'' low-pass filter, ''H''(''f''), removes the images, leaves the original spectrum, ''X''(''f''), and recovers the original signal from its samples.
  • x}}.
THEOREM
Nyquist theorem; Shannon sampling theorem; Nyquist sampling theorem; Nyquist's theorem; Shannon-Nyquist sampling theorem; Nyquist-Shannon Sampling Theorem; Nyqvist-Shannon sampling theorem; Sampling theorem; Nyquist Sampling Theorem; Nyquist-Shannon sampling theorem; Nyquist–Shannon theorem; Nyquist–Shannon Theorem; Nyquist Theorem; Shannon-Nyquist theorem; Nyquist sampling; Nyquist's law; Nyquist law; Coherent sampling; Nyqvist limit; Raabe condition; Nyquist-Shannon Theorem; Nyquist-Shannon theorem; Nyquist noise theorem; Shannon–Nyquist theorem; Kotelnikov-Shannon theorem; Kotelnikov–Shannon theorem; Nyquist-Shannon; Kotelnikov theorem; Nyquist's sampling theorem; Sampling Theorem; Nyquist Shannon theorem; Nyquist–Shannon–Kotelnikov sampling theorem; Whittaker–Shannon–Kotelnikov sampling theorem; Whittaker–Nyquist–Kotelnikov–Shannon sampling theorem; Nyquist-Shannon-Kotelnikov sampling theorem; Whittaker-Shannon-Kotelnikov sampling theorem; Whittaker-Nyquist-Kotelnikov-Shannon sampling theorem; Cardinal theorem of interpolation; WKS sampling theorem; Whittaker–Kotelnikow–Shannon sampling theorem; Whittaker-Kotelnikow-Shannon sampling theorem; Nyquist–Shannon–Kotelnikov; Whittaker–Shannon–Kotelnikov; Whittaker–Nyquist–Kotelnikov–Shannon; Nyquist-Shannon-Kotelnikov; Whittaker-Shannon-Kotelnikov; Whittaker-Nyquist-Kotelnikov-Shannon; Whittaker–Shannon sampling theorem; Whittaker–Nyquist–Shannon sampling theorem; Whittaker-Nyquist-Shannon sampling theorem; Whittaker-Shannon sampling theorem
теорема отсчетов (дискретазации)
accepting state         
  • TTL]] counter, a type of state machine
  • Fig. 5: Representation of an acceptor; this example shows one that determines whether a binary number has an even number of 0s, where ''S''<sub>1</sub> is an ''accepting state'' and ''S''<sub>2</sub> is a ''non accepting state''.
  • Fig. 3 Example of a simple finite-state machine
  • Fig. 6 Transducer FSM: Moore model example
  • Fig. 7 Transducer FSM: Mealy model example
  • Fig. 4: Acceptor FSM: parsing the string "nice".
  • Fig. 2 SDL state machine example
  • A turnstile
  • State diagram for a turnstile
  • Fig. 1 UML state chart example (a toaster oven)
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser

математика

поглощающее состояние

sampling theorem         
  • the sampled sequences are identical}}, even though the original continuous pre-sampled functions are not. If these were audio signals, <math>x(t)</math> and <math>x_A(t)</math> might not sound the same. But their samples (taken at rate ''f''<sub>s</sub>) are identical and would lead to identical reproduced sounds; thus ''x''<sub>A</sub>(''t'') is an alias of ''x''(''t'') at this sample rate.
  • The samples of two sine waves can be identical when at least one of them is at a frequency above half the sample rate.
  • A family of sinusoids at the critical frequency, all having the same sample sequences of alternating +1 and –1. That is, they all are aliases of each other, even though their frequency is not above half the sample rate.
  • Properly sampled image
  • Subsampled image showing a [[Moiré pattern]]
  • The figure on the left shows a function (in gray/black) being sampled and reconstructed (in gold) at steadily increasing sample-densities, while the figure on the right shows the frequency spectrum of the gray/black function, which does not change. The highest frequency in the spectrum is ½ the width of the entire spectrum. The width of the steadily-increasing pink shading is equal to the sample-rate. When it encompasses the entire frequency spectrum it is twice as large as the highest frequency, and that is when the reconstructed waveform matches the sampled one.
  • Spectrum, ''X<sub>s</sub>''(''f''), of a properly sampled bandlimited signal (blue) and the adjacent DTFT images (green) that do not overlap. A ''brick-wall'' low-pass filter, ''H''(''f''), removes the images, leaves the original spectrum, ''X''(''f''), and recovers the original signal from its samples.
  • x}}.
THEOREM
Nyquist theorem; Shannon sampling theorem; Nyquist sampling theorem; Nyquist's theorem; Shannon-Nyquist sampling theorem; Nyquist-Shannon Sampling Theorem; Nyqvist-Shannon sampling theorem; Sampling theorem; Nyquist Sampling Theorem; Nyquist-Shannon sampling theorem; Nyquist–Shannon theorem; Nyquist–Shannon Theorem; Nyquist Theorem; Shannon-Nyquist theorem; Nyquist sampling; Nyquist's law; Nyquist law; Coherent sampling; Nyqvist limit; Raabe condition; Nyquist-Shannon Theorem; Nyquist-Shannon theorem; Nyquist noise theorem; Shannon–Nyquist theorem; Kotelnikov-Shannon theorem; Kotelnikov–Shannon theorem; Nyquist-Shannon; Kotelnikov theorem; Nyquist's sampling theorem; Sampling Theorem; Nyquist Shannon theorem; Nyquist–Shannon–Kotelnikov sampling theorem; Whittaker–Shannon–Kotelnikov sampling theorem; Whittaker–Nyquist–Kotelnikov–Shannon sampling theorem; Nyquist-Shannon-Kotelnikov sampling theorem; Whittaker-Shannon-Kotelnikov sampling theorem; Whittaker-Nyquist-Kotelnikov-Shannon sampling theorem; Cardinal theorem of interpolation; WKS sampling theorem; Whittaker–Kotelnikow–Shannon sampling theorem; Whittaker-Kotelnikow-Shannon sampling theorem; Nyquist–Shannon–Kotelnikov; Whittaker–Shannon–Kotelnikov; Whittaker–Nyquist–Kotelnikov–Shannon; Nyquist-Shannon-Kotelnikov; Whittaker-Shannon-Kotelnikov; Whittaker-Nyquist-Kotelnikov-Shannon; Whittaker–Shannon sampling theorem; Whittaker–Nyquist–Shannon sampling theorem; Whittaker-Nyquist-Shannon sampling theorem; Whittaker-Shannon sampling theorem

общая лексика

теорема отсчетов

finite element analysis         
  • A function in <math>H_0^1,</math> with zero values at the endpoints (blue), and a piecewise linear approximation (red)
  • (c) The computed solution, <math>u(x, y)=1-x^2-y^2.</math>
  • (b) The [[sparse matrix]] ''L'' of the discretized linear system
  • Solving the two-dimensional problem <math>u_{xx}+u_{yy}=-4</math> in the disk centered at the origin and radius 1, with zero boundary conditions.<br />(a) The triangulation.
  • url=https://ris.utwente.nl/ws/files/6153316/CMBBE2014-Hamid-Submitted.pdf}}</ref>
  • A piecewise linear function in two dimensions
  • alt=
  • alt=
NUMERICAL METHOD FOR SOLVING PHYSICAL OR ENGINEERING PROBLEMS
Finite element analysis; Finite Element Analysis; Finite elements; Finite element; Finite Element Method; Engineering treatment of the finite element method; Finite element solver; Finite element meshing; Finite element problem; Engineering treatment of the Finite Element Method; Finite element methods; Finite difference method based on variation principle; Finite elements analysis; Finite-element method; Finite-element analysis; Finite-element methods; Nonlinear finite element analysis

строительное дело

расчёт методом конечных элементов

finite state machine         
  • TTL]] counter, a type of state machine
  • Fig. 5: Representation of an acceptor; this example shows one that determines whether a binary number has an even number of 0s, where ''S''<sub>1</sub> is an ''accepting state'' and ''S''<sub>2</sub> is a ''non accepting state''.
  • Fig. 3 Example of a simple finite-state machine
  • Fig. 6 Transducer FSM: Moore model example
  • Fig. 7 Transducer FSM: Mealy model example
  • Fig. 4: Acceptor FSM: parsing the string "nice".
  • Fig. 2 SDL state machine example
  • A turnstile
  • State diagram for a turnstile
  • Fig. 1 UML state chart example (a toaster oven)
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser

общая лексика

конечный автомат, КА

вычислительная модель, описывающая автомат с конечным числом состояний. Одно из них называется "начальным состоянием". Автомат переходит из одного состояния в другое под влиянием "управления", зависящего от внешних воздействий: получаемых сигналов или данных. Назначением каждого состояния является запоминание определённого момента истории системы. По типу управления КА делятся на детерминированные (находящиеся в каждый момент времени только в одном состоянии) и недетерминированные (могут одновременно находиться в нескольких состояниях). КА широко применяются в программировании, например в лексических анализаторах компиляторов

синоним

finite-state machine; FSM

Смотрите также

cumulative throughflow; fractional throughflow

correction fluid         
  • Correction pen
OPAQUE WHITE FLUID APPLIED TO PAPER TO MASK ERRORS IN TEXT
Whiting out; Corrective fluid; Correction pen; Correction Fluid; Twink (correction fluid); Whitener pen

[kə'rekʃ(ə)nflu:id]

общая лексика

корректурная жидкость (для исправления машинописных и рукописных работ)

finite element method         
  • A function in <math>H_0^1,</math> with zero values at the endpoints (blue), and a piecewise linear approximation (red)
  • (c) The computed solution, <math>u(x, y)=1-x^2-y^2.</math>
  • (b) The [[sparse matrix]] ''L'' of the discretized linear system
  • Solving the two-dimensional problem <math>u_{xx}+u_{yy}=-4</math> in the disk centered at the origin and radius 1, with zero boundary conditions.<br />(a) The triangulation.
  • url=https://ris.utwente.nl/ws/files/6153316/CMBBE2014-Hamid-Submitted.pdf}}</ref>
  • A piecewise linear function in two dimensions
  • alt=
  • alt=
NUMERICAL METHOD FOR SOLVING PHYSICAL OR ENGINEERING PROBLEMS
Finite element analysis; Finite Element Analysis; Finite elements; Finite element; Finite Element Method; Engineering treatment of the finite element method; Finite element solver; Finite element meshing; Finite element problem; Engineering treatment of the Finite Element Method; Finite element methods; Finite difference method based on variation principle; Finite elements analysis; Finite-element method; Finite-element analysis; Finite-element methods; Nonlinear finite element analysis

строительное дело

метод конечных элементов

Определение

Nyquist Theorem
<communications> A theorem stating that when an analogue waveform is digitised, only the frequencies in the waveform below half the sampling frequency will be recorded. In order to reconstruct (interpolate) a signal from a sequence of samples, sufficient samples must be recorded to capture the peaks and troughs of the original waveform. If a waveform is sampled at less than twice its frequency the reconstructed waveform will effectively contribute only noise. This phenomenon is called "aliasing" (the high frequencies are "under an alias"). This is why the best digital audio is sampled at 44,000 Hz - twice the average upper limit of human hearing. The Nyquist Theorem is not specific to digitised signals (represented by discrete amplitude levels) but applies to any sampled signal (represented by discrete time values), not just sound. {Nyquist (http://geocities.com/bioelectrochemistry/nyquist.htm)} (the man, somewhat inaccurate). (2003-10-21)
Показать больше определений

Википедия

Point-finite collection

In mathematics, a collection or family U {\displaystyle {\mathcal {U}}} of subsets of a topological space X {\displaystyle X} is said to be point-finite if every point of X {\displaystyle X} lies in only finitely many members of U . {\displaystyle {\mathcal {U}}.}

A metacompact space is a topological space in which every open cover admits a point-finite open refinement. Every locally finite collection of subsets of a topological space is also point-finite. A topological space in which every open cover admits a locally finite open refinement is called a paracompact space. Every paracompact space is therefore metacompact.

https://en.wikipedia.org/wiki/Point-finite collection
Как переводится finite sampling correction на Русский язык
Поиск в словаре
Все словари Английский словарь Англо-арабский словарь Англо-голландский словарь Англо-греческий словарь Англо-испанский словарь Англо-итальянский словарь Англо-немецкий словарь Англо-русский словарь Англо-французский словарь Арабский словарь Голландский словарь Греческий словарь Испанский словарь Итальянский словарь Итальянско-русский словарь Латинско-испанский словарь Латинско-португальский словарь Немецкий словарь Португальский словарь Португальско-русский словарь Русский словарь Французский словарь Французско-русский словарь
Создано ИИ
Английский Русский Испанский Португальский Немецкий Французский Греческий Голландский Итальянский Арабский
Язык интерфейса
Русский English Español Português Deutsch Français Ελληνικά Nederlands Italiano عربي
Контакты
Свяжитесь с нами



Конфиденциальность
Политика конфиденциальности